T-structures, T-functions, and texts
نویسندگان
چکیده
The theory of '-structures [see, e.g., Ehrenfeucht and Rozenberg (1990)] provides a convenient framework for investigating various mathematical structures encountered in computer science. This paper investigates a subclass of 2-structures, called T-srrucrurrs, which turned out to be important in the investigation of basic properties of 2-structures [see Ehrenfeucht and Rozenberg (1992)]. We prove that T-structures are a natural generalization of linear orders; in particular, we prove that a T-structure can be represented by two linear orders. Based on this result, the notion of a felt is introduced which generalizes the notion of a word as used in formal language theory. A text may be seen as a word with a " structure " spanned on it: this structure may be a tree, but it may also be more general than a tree. Basic properties of the class of texts corresponding to trees are investigated.
منابع مشابه
The Effect of Textual Enhancement Types on EFL Learners’ Grammatical Awareness of Simple and Complex Structures
The purpose of this study was to investigate the effect of textual enhancement types on English as Foreign Language ( EFL ) learn er s ’ grammatical awareness of simple and complex structures. A nu m- ber of 104 learners from Ayandegan Institute, in Tehran, participated in this study. To homogenize the samples, the researchers administered a placement Michigan Test of English language to the p...
متن کاملVolume functions of historical texts and the amplitude correlation principle
A new empirico-statistical model is suggested to distinguish dependent narrative texts from independent narrative texts by means of their volume functions. A "regard for information" principle and an "amplitude correlation" principle are formulated. The model and both principles are examined experimentally using specific historical texts.
متن کاملFully-online Construction of Suffix Trees for Multiple Texts
We consider fully-online construction of indexing data structures for multiple texts. Let T = {T1, . . . , TK} be a collection of texts. By fully-online, we mean that a new character can be appended to any text in T at any time. This is a natural generalization of semi-online construction of indexing data structures for multiple texts in which, after a new character is appended to the kth text ...
متن کاملFully-online construction of suffix trees and DAWGs for multiple texts
We consider fully-online construction of indexing data structures for multiple texts. Let T = {T1, . . . , TK} be a collection of texts. By fully-online, we mean that a new character can be appended to any text in T at any time. This is a natural generalization of semi-online construction of indexing data structures for multiple texts in which, after a new character is appended to the kth text ...
متن کاملRepresentation of $H$-closed monoreflections in archimedean $ell$-groups with weak unit
The category of the title is called $mathcal{W}$. This has all free objects $F(I)$ ($I$ a set). For an object class $mathcal{A}$, $Hmathcal{A}$ consists of all homomorphic images of $mathcal{A}$-objects. This note continues the study of the $H$-closed monoreflections $(mathcal{R}, r)$ (meaning $Hmathcal{R} = mathcal{R}$), about which we show ({em inter alia}): $A in mathcal{A}$ if and only if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 116 شماره
صفحات -
تاریخ انتشار 1993